The arnoldi process, short recursions, and displacement ranks
نویسندگان
چکیده
منابع مشابه
Displacement Convexity in Spatially Coupled Scalar Recursions
We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential functional. We show, under mild conditions, that the potential functional is displacement convex and that the minimizers are given by the fixed points of the recursions. Furthermore, we give the condition...
متن کاملDisplacement Ranks of a Matrix
The solution of many problems in physics and engineering reduces ultimately to the solution of linear equations of the form Ra = m, where JR and m are given N x N and N x 1 matrices and a is to be determined. Here our concern is with the fact that it generally takes 0(N) computations (one computation being the multiplication of two real numbers) to do this, and this might be a substantial burde...
متن کاملConvergence of the Isometric Arnoldi Process
It is well known that the performance of eigenvalue algorithms such as the Lanczos and the Arnoldi method depends on the distribution of eigenvalues. Under fairly general assumptions we characterize the region of good convergence for the Isometric Arnoldi Process. We also determine bounds for the rate of convergence and we prove sharpness of these bounds. The distribution of isometric Ritz valu...
متن کاملQuadrature Rules Based on the Arnoldi Process
Applying a few steps of the Arnoldi process to a large nonsymmetric matrix A with initial vector v is shown to induce several quadrature rules. Properties of these rules are discussed, and their application to the computation of inexpensive estimates of the quadratic form 〈f, g〉 := v∗(f(A))∗g(A)v and related quadratic and bilinear forms is considered. Under suitable conditions on the functions ...
متن کاملThe Arnoldi Process and GMRES for Nearly Symmetric Matrices
Matrices with a skew-symmetric part of low rank arise in many applications, including path following methods and integral equations. This paper explores the properties of the Arnoldi process when applied to such a matrix. We show that an orthogonal Krylov subspace basis can be generated with short recursion formulas and that the Hessenberg matrix generated by the Arnoldi process has a structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)82725-5